A Strategy for a Distance Based Index Structure to Refine Multimedia Queries

نویسنده

  • Kasturi Chatterjee
چکیده

This paper proposes a hybrid query refinement model for distance-based index structures supporting contentbased image retrievals. The framework refines a query by considering both the low-level feature space as well as the high-level semantic interpretations separately. Thus, it successfully handles queries where the gap between the feature components and the semantics is large. It refines the low-level feature space, indexed by the distance based index structure, in multiple iterations by introducing the concept of multipoint query in a metric space. It refines the high-level semantic space by dynamically adjusting the constructs of a framework, called the Markov Model Mediator (MMM), utilized to introduce the semantic relationships in the index structure. A k-nearest neighbor (k-NN) algorithm is designed to handle similarity searches that refine a query in multiple iterations utilizing the proposed hybrid query refinement model. Extensive experiments are performed demonstrating an increased relevance of query results in subsequent iterations while incurring a low computational overhead. Further, an evaluation metric, called the Model_Score, is proposed to compare the performance of different retrieval frameworks in terms of both computation overhead and query result relevance. This metric enables the users to choose the retrieval framework appropriate for their requirements. DOI: 10.4018/jmdem.2011070104 International Journal of Multimedia Data Engineering and Management, 2(3), 52-71, July-September 2011 53 Copyright © 2011, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. capture the users’ interest pattern are made with a strategy called query refinement having two major components namely query modification and query re-weighting (Porkaew, Chakrabarti, & Mehrotra, 1999). In query modification, the query representation is modified in each iteration to reach the region in the feature space which best describes the feature components of the users’ requirement. In query re-weighting, the semantic component of a query is modified in subsequent iterations to better capture the users’ perception. As a query is refined, the similarity search and the distance functions utilized to determine the similarity need to be modified as well. Automatically, it becomes necessary that the index structures, supporting the similarity searches, also accommodate the modified distance functions developed for the refined queries. Multidimensional index structures can be broadly divided into two categories viz. feature-based and distance-based. A feature based indexing technique projects an image as a feature vector into a multidimensional space and index it. Some feature based index structures are KDB-tree (Robinson, 1981), Rtree (Guttman, 1984), etc. On the other hand distance based indexing structures are built based on the distances or similarities between two data objects. Some famous distance based index structures are M-Tree (Ciaccia, Patella, & Zezula, 1997) and vp-tree (Yianilos, 1993). Both categories are useful depending on the dataset in hand and the application that need to be supported. Though query refinement strategies have been designed for feature-based index structures as in Porkaew, Ortega, and Mehrotra (1999), Chakrabarti and Mehrotra (1999), and Chakrabarti, Porkaew, Ortega, and Mehrotra (2004) but to the best of our knowledge there has been no such attempt for distance-based index structures. Another major drawback is that if the semantic information of a multimedia object cannot be interpreted completely in terms of the inter and intra feature weights (when the semantic gap is large), refinement strategies (Porkaew, Chakrabarti, & Mehrotra, 1999) fail to produce satisfactory results. The semantic gap is a very common problem for multimedia data and is illustrated in Figure 1 for an image database where the feature-level similarity failed to capture users’ high-level semantic perception. Figure 1(a) represents the inverse of the Euclidean Distance (similarity) between the feature vectors of an image with other images of a database. Figure 1(b) represents the high-level semantic relationship between the same image with other images in the database. It’s seen that the image, with which the image under consideration shares a low similarity in terms of feature space, has a very high semantic relationship with it. In this paper, we propose a hybrid query refinement model for distance based index structures, which organizes and manages mainly images. However, the refinement model used here can be utilized for indexing other multimedia objects such as videos as long as the distance based index structure can organize the particular data type. The proposed query refinement strategy is called hybrid because it refines and adjusts both the low-level feature space as well as high-level semantic interpretations individually during refining the queries in each iteration. It adopts a query expansion approach to refine the feature space. To refine the semantic interpretation of a query, it dynamically adjusts the parameter of a stochastic construct called Markov Model Mediator (MMM) (Shyu, Chen, Chen, Zhang, & Shu, 2003). We introduce the hybrid query refinement ensemble in a distance-based index structure and enable the similarity search algorithms to implement it to improve query results progressively in subsequent iterations. We also propose a new evaluation score called the Model_Score that can compare the overall performance of the different multimedia retrieval frameworks in terms of both computation time and F1 Score (relevance). Both the response time and the relevance of a query result is important in case of similarity queries for multimedia data. Thus, while evaluating and comparing the performance of index structures for multimedia data, one should be able to view the combined effect of both these criteria on 18 more pages are available in the full version of this document, which may be purchased using the "Add to Cart" button on the product's webpage: www.igi-global.com/article/hybrid-queryrefinement/58051?camid=4v1 This title is available in InfoSci-Journals, InfoSci-Journal Disciplines Communications and Social Science, InfoSciCommunications, Online Engagement, and Media eJournal Collection, InfoSci-Knowledge Discovery, Information Management, and Storage eJournal Collection, InfoSciNetworking, Mobile Applications, and Web Technologies eJournal Collection, InfoSci-Surveillance, Security, and Defense eJournal Collection. Recommend this product to

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Query Refinement: A Strategy for a Distance Based Index Structure to Refine Multimedia Queries

This paper proposes a hybrid query refinement model for distance-based index structures supporting contentbased image retrievals. The framework refines a query by considering both the low-level feature space as well as the high-level semantic interpretations separately. Thus, it successfully handles queries where the gap between the feature components and the semantics is large. It refines the ...

متن کامل

Fr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories

vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...

متن کامل

Popularity-Based Ranking for Fast Approximate kNN Search

Similarity searching has become widely available in many on-line archives of multimedia data. Users accessing such systems look for data items similar to their specific query object and typically refine results by re-running the search with a query from the results. We study this issue and propose a mechanism of approximate kNN query evaluation that incorporates statistics of accessing index da...

متن کامل

Parallel Strategies for Multimedia Web Services

This paper describes a parallel data structure used to perform multimedia web searches. The Spatial Approximation Tree(SAT) is the data structure selected to index queries, where the complexity measure is given by the number of distance computed to retrieve those objects close enough to the query. We present some parallel methods for load balancing the work performed by the processors. The meth...

متن کامل

Solving Multiple Queries through a Permutation Index in GPU

Query-by-content by means of similarity search is a fundamental operation for applications that deal with multimedia data. For this kind of query it is meaningless to look for elements exactly equal to the one given as query. Instead, we need to measure dissimilarity between the query object and each database object. The metric space model is a paradigm that allows modeling all similarity searc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016